منابع مشابه
Notes 9 : Expander codes , beginning of list decoding
Definition 1 (distance amplified code G(C)) Let G = (L,R,E) be a bipartite graph with L = [n], R = [m], which is D-left-regular and d-right-regular. Let C be a binary linear code of block length n = |L|. For c ∈ {0, 1}n, define G(c) ∈ ({0, 1}d)m by G(c)j = (cΓ1(j), cΓ2(j), · · · , cΓd(j)), for j ∈ [m], where Γi(j) ∈ L denotes the i-th neighbor of j ∈ R. Now define the code G(C) as G(C) = {G(c)|...
متن کاملLP decoding of expander codes: a simpler proof
A code C ⊆ Fn 2 is a (c, ǫ, δ)-expander code if it has a Tanner graph, where every variable node has degree c, and every subset of variable nodes L0 such that |L0| ≤ δn has at least ǫc|L0| neighbors. Feldman et al. (IEEE IT, 2007) proved that LP decoding corrects 3ǫ−2 2ǫ−1 · (δn − 1) errors of (c, ǫ, δ)expander code, where ǫ > 2 3 + 1 3c . In this paper, we provide a simpler proof of their resu...
متن کاملEfficient decoding of random errors for quantum expander codes
We show that quantum expander codes, a constant-rate family of quantum LDPC codes, with the quasi-linear time decoding algorithm of Leverrier, Tillich and Zémor can correct a constant fraction of random errors with very high probability. This is the first construction of a constant-rate quantum LDPC code with an efficient decoding algorithm that can correct a linear number of random errors with...
متن کاملCodes and Iterative Decoding on Algebraic Expander Graphs
The notion of graph expansion was introduced as a tool in coding theory by Sipser and Spielman, who used it to bound the minimum distance of a class of low-density codes, as well as the performance of various iterative decoding algorithms for these codes. In spite of its usefulness in establishing theoretical bounds on iterative decoding, graph expansion has not been widely used to design codes...
متن کاملFast Unique Decoding of Plane Ag Codes
An interpolation-based unique decoding algorithm of Algebraic Geometry codes was recently introduced. The algorithm iteratively computes the sent message through a majority voting procedure using the Gröbner bases of interpolation modules. We now combine the main idea of the Guruswami-Sudan list decoding with the algorithm, and thus obtain a hybrid unique decoding algorithm of plane AG codes, s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2018
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2017.2726064